Combining Traditional Map Labeling with Boundary Labeling
نویسندگان
چکیده
The traditional map labeling problems are mostly NP-hard. Hence, effective heuristics and approximations have been developed in the past. Recently, efficient algorithms for the so-called boundary labeling model have been introduced which assumes that the labels are placed on the boundary of the map and connected by polygonal leaders to their corresponding sites. Internal labels have been forbidden. In this paper, we allow both. Since clearly internal labels should be preferred, we consider several maximization problems for the number of internal labels and we show that they can be obtained efficiently or in quasi-polynomial time.
منابع مشابه
Terminology of Combining the Sentences of Farsi Language with the Viterbi Algorithm and BI-GRAM Labeling
This paper, based on the Viterbi algorithm, selects the most likely combination of different wording from a variety of scenarios. In this regard, the Bi-gram and Unigram tags of each word, based on the letters forming the words, as well as the bigram and unigram labels After the breakdown into the composition or moment of transition from the decomposition to the combination obtained from th...
متن کامل3-difference cordial labeling of some cycle related graphs
Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...
متن کاملSkolem Odd Difference Mean Graphs
In this paper we define a new labeling called skolem odd difference mean labeling and investigate skolem odd difference meanness of some standard graphs. Let G = (V,E) be a graph with p vertices and q edges. G is said be skolem odd difference mean if there exists a function f : V (G) → {0, 1, 2, 3, . . . , p + 3q − 3} satisfying f is 1−1 and the induced map f : E(G) → {1, 3, 5, . . . , 2q−1} de...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملEdge pair sum labeling of spider graph
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...
متن کامل